Optimal Boolean Function Simplification through K-Map using Object-Oriented Algorithm
نویسندگان
چکیده
منابع مشابه
Optimal Boolean Function Simplification through K-Map using Object-Oriented Algorithm
It is well known that the Karnaugh-map technique is an elegant teaching resource for academics and a systematic and powerful tool for a digital designer in minimizing low order Boolean functions. Why is the minimization of the Boolean expression needed? By simplifying the logic function, we can reduce the original number of digital components (gates) required to implement digital circuits. Ther...
متن کاملAlgorithm Simplification Through Object Orientation
The object oriented (O-O) approach is claimed to have a number of advantages. Some support to these claims appeared during an O-O redesign of a legacy CAD system. A surprisingly simple and efficient solution algorithm was discovered for a change propagation problem. The analysis of the case employs the new concepts of implementation and extension complexity, which indicate the amount of code (s...
متن کاملPocket–pc Boolean Function Simplification
In this paper a useful educational tool is presented for minimizing low order Boolean expressions. The algorithm follows the Karnaugh map looping approach. For the implementation, which provides optimal results, C++ coding was used on the Embedded Visual C++ 3.0 Pocket PC using Windows CE Operating System environment. In order to make the overall implementation efficient, the object oriented ap...
متن کاملSimplification of Boolean Algebra through DNA Computing
DNA Computing utilizes the properties of DNA for performing the computations. The computations include arithmetic and logical operations such as simplification of Boolean expression to its simplest form. Boolean function can be built from ANDs, ORs, and NOTs using minterm expansion. However, a practicing computer engineer will very rarely be satisfied with a minterm expansion, because as a rule...
متن کاملFrom Relational to Object-Oriented Integrity Simplification
1 Relational integrity checking technology can be transfered to deductive object bases by utilizing a simple logical framework for objects. The principles of object identity, aggregation and classi cation allow a more e cient constraint control by ner granularity of updates, composite updates and semantic constraint simpli cation. In many cases, meta-level constraints and deductive rules can be...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Applications
سال: 2011
ISSN: 0975-8887
DOI: 10.5120/1959-2621